منابع مشابه
Relaxed Scheduling in Dynamic Skin Triangulation
We introduce relaxed scheduling as a paradigm for mesh maintenance and demonstrate its applicability to triangulating a skin surface in .
متن کاملDynamic Parallel 3D Delaunay Triangulation
Delaunay meshing is a popular technique for mesh generation. Usually, the mesh has to be refined so that certain fidelity and quality criteria are met. Delaunay refinement is achieved by dynamically inserting and removing points in/from a Delaunay triangulation. In this paper, we present a robust parallel algorithm for computing Delaunay triangulations in three dimensions. Our triangulator offe...
متن کاملOptimizing the triangulation of Dynamic Bayesian Networks
In this paper, we address the problem of finding good quality elimination orders for triangulating dynamic Bayesian networks. In Bilmes and Bartels (2003), the authors proposed a model and an algorithm to compute such orders, but in exponential time. We show that this can be done in polynomial time by casting the problem to the problem of finding a minimum s–t cut in a graph. In this approach, ...
متن کاملSkin lesion image segmentation using Delaunay Triangulation for melanoma detection
Developing automatic diagnostic tools for the early detection of skin cancer lesions in dermoscopic images can help to reduce melanoma-induced mortality. Image segmentation is a key step in the automated skin lesion diagnosis pipeline. In this paper, a fast and fully-automatic algorithm for skin lesion segmentation in dermoscopic images is presented. Delaunay Triangulation is used to extract a ...
متن کاملFully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation
The Delaunay Tree is a hierarchical data structure that has been introduced in [7] and analyzed in [6, 4]. For a given set of sites S in the plane and an order of insertion for these sites, the Delaunay Tree stores all the successive Delaunay triangulations. As proved before, the Delaunay Tree allows the insertion of a site in logarithmic expected time and linear expected space, when the insert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2001
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-001-0007-1